package com.cuz.series.binarytree;

/***
 * 不同的二叉搜索树
 * https://leetcode.cn/problems/unique-binary-search-trees/
 */
public class 二叉树2不同的二叉搜索树1 {
    public static void main(String[] args) {
        System.out.println(numTrees1(3));
    }

    public static int numTrees1(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        dp[1] = 1;

        for (int i = 2; i <= n; ++i) {
            for (int j = 1; j <= i; ++j) {
                dp[i] += dp[j - 1] * dp[i - j];
            }
        }
        return dp[n];
    }




}
